منابع مشابه
Nonuniform Coercions via Unification Hints
We introduce the notion of nonuniform coercion, which is the promotion of a value of one type to an enriched value of a different type via a nonuniform procedure. Nonuniform coercions are a generalization of the (uniform) coercions known in the literature and they arise naturally when formalizing mathematics in an higher order interactive theorem prover using convenient devices like canonical s...
متن کاملHints in Unification
Several mechanisms such as Canonical Structures [14], Type Classes [16, 13], or Pullbacks [10] have been recently introduced with the aim to improve the power and flexibility of the type inference algorithm for interactive theorem provers. We claim that all these mechanisms are particular instances of a simpler and more general technique, just consisting in providing suitable hints to the unifi...
متن کاملHints of Grand Unification in Neutrino Data ∗
There are strong indications for neutrino masses and mixings in the data on solar neutrinos , the observed deficit of muon neutrinos from the atmosphere as well as from discussions of the dark matter of the universe after COBE data. It is argued that an SO(10) grand unified theory has the right symmetry breaking properties needed to accomodate the neutrino masses and mixings suggested by these ...
متن کاملDependent Coercions
A notion of dependent coercion is introduced and studied in the context of dependent type theories. It extends our earlier work on coercive subtyping into a uniform framework which increases the expressive power with new applications. A dependent coercion introduces a subtyping relation between a type and a family of types in that an object of the type is mapped into one of the types in the fam...
متن کاملStrong Normalization of ML via a Calculus of Coercions
ML is a type system extending ML with first-class polymorphism as in system F. The main goal of the present paper is to show that ML enjoys strong normalization, i.e., it has no infinite reduction paths. The proof of this result is achieved in several steps. We first focus on xML, the Church-style version of ML, and show that it can be translated into a calculus of coercions: terms are mapped i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.53.2